Backtracking algorithms for disjunctions of temporal constraints
نویسندگان
چکیده
منابع مشابه
Backtracking Algorithms for Disjunctions of Temporal Constraints
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 − y1 6 r1 ∨ · · · ∨ xn − yn 6 rn, where x1, . . . , xn, y1, . . . , yn are variables ranging over the real numbers, r1, . . . , rn are real constants, and n> 1. This is a wide class of temporal constraints that can be used to model a variety of problems in te...
متن کاملBacktracking Algorithms for Disjunctions of Temporal Constraints*t
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form xl yl < rl V... v xn yn <_ rn, where xl ... xn, yl ... yn are variables ranging over the real numbers, rl... rn are real constants, and n > 1. We have implemented four progressively more efficient algorithms for the consistency checking problem for this class of...
متن کاملTractable Disjunctions of Linear Constraints
We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and inequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez and McAloon. We show that deciding consistency of a set of constraints in this class can be done in pol...
متن کاملIncremental Algorithms for Managing Temporal Constraints
This paper addresses the problem of eeciently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then we focus on a sub...
متن کاملEvaluating Consistency Algorithms for Temporal Metric Constraints
We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the 4STP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that 4STP is the most efficient for dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2000
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00019-9